Algorithms and data structurese (Waterloo ON, 15-17 August 2005)Dehne, Frank; Lopez-Ortiz, Alejandro; Sack, Jörg-Rüdiger et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28101-0, XIV, 446 p, isbn 3-540-28101-0Conference Proceedings

Efficient data structures for deduction systemsOHLBACH, H. J.Lecture notes in computer science. 1997, Vol 1341, pp 1-2, issn 0302-9743, isbn 3-540-63792-3Conference Paper

WADS 2003 : algorithms and data structures (Ottawa ON, 30 July - 1 August 2003)Dehne, Frank; Sack, Jörg-Rüdiger; Smid, Michiel et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40545-3, XII, 522 p, isbn 3-540-40545-3Conference Proceedings

Circular programs and self-referential structuresALLISON, L.Software, practice & experience. 1989, Vol 19, Num 2, pp 99-109, issn 0038-0644Article

Constraint relation implementation for finite element analysis from an element basisSAN-CHENG CHANG; TSUNG-WU LIN.Advances in engineering software (1978). 1988, Vol 10, Num 4, pp 191-194, issn 0141-1195Article

Collection-oriented languagesSIPELSTEIN, J. M; BLELLOCH, G. E.Proceedings of the IEEE. 1991, Vol 79, Num 4, pp 504-523, issn 0018-9219, 20 p.Article

Isotropic vector matrix grid and face-centered cubic lattice data structuresNYSTROM, J. F; BELLOMO, Carryn.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part III, 1096-1099Conference Paper

Efficient state updates for Key managementPINKAS, Benny.Lecture notes in computer science. 2002, pp 40-56, issn 0302-9743, isbn 3-540-43677-4Conference Paper

Lossy dictionariesPAGH, Rasmus; RODLER, Flemming Friche.Lecture notes in computer science. 2001, pp 300-311, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Parlists - A generalization of powerlistsKORNERUP, J.Lecture notes in computer science. 1997, pp 614-618, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Which extended Goppa codes are cyclic?STICHTENOTH, H.Journal of combinatorial theory. Series A. 1989, Vol 51, Num 2, pp 205-220, issn 0097-3165Article

No sorting? Better searching!FRANCESCHINI, Gianni; GROSSI, Roberto.Annual Symposium on Foundations of Computer Science. 2004, pp 491-498, isbn 0-7695-2228-9, 1Vol, 8 p.Conference Paper

A type specialisation tutorialHUGHES, J.Lecture notes in computer science. 1999, pp 293-325, issn 0302-9743, isbn 3-540-66710-5Conference Paper

Adaptive linear list reorganization under a generalized query systemVALIVETI, R. S; OOMMEN, B. J; ZGIERSKI, J. R et al.Journal of applied probability. 1995, Vol 32, Num 3, pp 793-804, issn 0021-9002Article

Succinct data structures for assembling large genomesCONWAY, Thomas C; BROMAGE, Andrew J.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 4, pp 479-486, issn 1367-4803, 8 p.Article

Line-segment intersection made in-placeVAHRENHOLD, Jan.Lecture notes in computer science. 2005, pp 146-157, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

A library of algorithms for graph drawingGUTWENGER, Carsten; JÜNGER, Michael; KLAU, Gunnar W et al.Lecture notes in computer science. 2002, pp 473-474, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Exploiting pseudo models for TBox and ABox reasoning in expressive description logicsHAARSLEV, Volker; MÖLLER, Ralf; TURHAN, Anni-Yasmin et al.Lecture notes in computer science. 2001, pp 61-75, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Confluently persistent deques via data-structural bootstrappingBUCHSBAUM, A. L; TARJAN, R. E.Journal of algorithms (Print). 1995, Vol 18, Num 3, pp 513-547, issn 0196-6774Conference Paper

On efficient entreeingsAMERINS, P. S; BAEZA-YATES, R. A; WOOD, D et al.Acta informatica. 1993, Vol 30, Num 3, pp 203-213, issn 0001-5903Article

Deques with heap orderGAJEWSKA, H; TARJAN, R. E.Information processing letters. 1986, Vol 22, Num 4, pp 197-200, issn 0020-0190Article

A simpler linear-time recognition of circular-arc graphsKAPLAN, Haim; NUSSBAUM, Yahav.Lecture notes in computer science. 2006, pp 41-52, issn 0302-9743, isbn 3-540-35753-X, 1Vol, 12 p.Conference Paper

Finding the position of the k-mismatch and approximate tandem repeatsKAPLAN, Haim; PORAT, Ely; SHAFRIR, Nira et al.Lecture notes in computer science. 2006, pp 90-101, issn 0302-9743, isbn 3-540-35753-X, 1Vol, 12 p.Conference Paper

Parameterized complexity of generalized vertex cover problemsJIONG GUO; NIEDERMEIER, Rolf; WERNICKE, Sebastian et al.Lecture notes in computer science. 2005, pp 36-48, issn 0302-9743, isbn 3-540-28101-0, 13 p.Conference Paper

Compressed index for dynamic textHON, Wing-Kai; LAM, Tak-Wah; SADAKANE, Kunihiko et al.Data Compression Conference. 2004, pp 102-111, isbn 0-7695-2082-0, 1Vol, 10 p.Conference Paper